Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems
نویسندگان
چکیده
This paper is concerned with the Hermitian definite generalized eigenvalue problem A− λB for block diagonal matrices A 1⁄4 diagðA11; A22Þ and B 1⁄4 diagðB11; B22Þ. Both A and B are Hermitian, and B is positive definite. Bounds on how its eigenvalues vary when A and B are perturbed by Hermitian matrices are established. These bounds are generally of linear order with respect to the perturbations in the diagonal blocks and of quadratic order with respect to the perturbations in the off-diagonal blocks. The results for the case of no perturbations in the diagonal blocks can be used to bound the changes of eigenvalues of a Hermitian definite generalized eigenvalue problem after its off-diagonal blocks are dropped, a situation that occurs frequently in eigenvalue computations. The presented results extend those of Li and Li [Linear Algebra Appl., 395 (2005), pp. 183–190]. It was noted by Stewart and Sun [Matrix Perturbation Theory, Academic Press, Boston, 1990] that different copies of a multiple eigenvalue may exhibit quite different sensitivities towards perturbations. We establish bounds to reflect that feature, too. We also derive quadratic eigenvalue bounds for diagonalizable non-Hermitian pencils subject to off-diagonal perturbations.
منابع مشابه
Perturbation of Partitioned Hermitian Generalized Eigenvalue Problem
We are concerned with the perturbation of a multiple eigenvalue μ of the Hermitian matrix A = diag(μI,A22) when it undergoes an off-diagonal perturbation E whose columns have widely varying magnitudes. When some of E’s columns are much smaller than the others, some copies of μ are much less sensitive than any existing bound suggests. We explain this phenomenon by establishing individual perturb...
متن کاملErratum: Perturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems
The main purpose of this erratum is to correct mistakes in the proof of Theorem 2.4 of [R.-C. Li et al., SIAM J. Matrix Anal. Appl., 32 (2011), pp. 642–663] and in the inequalities (2.23), (2.24), and (2.25) on p. 653 of the same paper.
متن کاملConvergence analysis of a locally accelerated preconditioned steepest descent method for Hermitian-definite generalized eigenvalue problems
By extending the classical analysis techniques due to Samokish, Faddeev and Faddeeva, and Longsine and McCormick among others, we prove the convergence of preconditioned steepest descent with implicit deflation (PSD-id) method for solving Hermitian-definite generalized eigenvalue problems. Furthermore, we derive a nonasymptotic estimate of the rate of convergence of the PSD-id method. We show t...
متن کاملThe Definite Generalized Eigenvalue Problem: A New Perturbation Theory
Let (A, B) be a definite pair of n × n Hermitian matrices. That is, |x∗Ax| + |x∗Bx| 6= 0 for all non-zero vectors x ∈ C. It is possible to find an n × n non-singular matrix X with unit columns such that X∗(A + iB)X = diag(α1 + iβ1, . . . , αn + iβn) where αj and βj are real numbers. We call the pairs (αj, βj) normalized generalized eigenvalues of the definite pair (A, B). These pairs have not b...
متن کاملOn the condition numbers of a multiple eigenvalue of a generalized eigenvalue problem
For standard eigenvalue problems, closed-form expressions for the condition numbers of a multiple eigenvalue are known. In particular, they are uniformly 1 in the Hermitian case and generally take different values in the non-Hermitian case. We consider the generalized eigenvalue problem and identify the condition numbers. Our main result is that a multiple eigenvalue generally has multiple cond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 32 شماره
صفحات -
تاریخ انتشار 2011